Human-like global positioning system (gps) directions

ABSTRACT

In one embodiment, a method includes receiving a request for a route from a first geolocation to a second geolocation; calculating the route from the first geolocation to the second geolocation; identifying one or more logged paths of a user that coincide with at least a portion of the route; updating one or more navigation instructions for the route based on the identified logged paths of the user; and providing the updated navigation instructions.

PRIORITY

This application is a continuation under 35 U.S.C. §120 of U.S. patentapplication Ser. No. 14/561,097, filed 4 Dec. 2014, which is acontinuation under 35 U.S.C. §120 of U.S. patent application Ser. No.13/926,392, filed 25 Jun. 2013.

TECHNICAL FIELD

This disclosure generally relates to mobile devices.

BACKGROUND

A social-networking system, which may include a social-networkingwebsite, may enable its users (such as persons or organizations) tointeract with it and with each other through it. The social-networkingsystem may, with input from a user, create and store in thesocial-networking system a user profile associated with the user. Theuser profile may include demographic information, communication-channelinformation, and information on personal interests of the user. Thesocial-networking system may also, with input from a user, create andstore a record of relationships of the user with other users of thesocial-networking system, as well as provide services (e.g., wall posts,photo-sharing, event organization, messaging, games, or advertisements)to facilitate social interaction between or among users.

The social-networking system may send over one or more networks contentor messages related to its services to a mobile or other computingdevice of a user. A user may also install software applications on amobile or other computing device of the user for accessing a userprofile of the user and other data within the social-networking system.The social-networking system may generate a personalized set of contentobjects to display to a user, such as a newsfeed of aggregated storiesof other users connected to the user.

A mobile computing device—such as a smartphone, tablet computer, orlaptop computer—may include functionality for determining its location,direction, or orientation, such as a GPS receiver, compass, gyroscope,or accelerometer. Such a device may also include functionality forwireless communication, such as BLUETOOTH communication, near-fieldcommunication (NFC), or infrared (IR) communication or communicationwith a wireless local area networks (WLANs) or cellular-telephonenetwork. Such a device may also include one or more cameras, scanners,touchscreens, microphones, or speakers. Mobile computing devices mayalso execute software applications, such as games, web browsers, orsocial-networking applications. With social-networking applications,users may connect, communicate, and share information with other usersin their social networks.

SUMMARY OF PARTICULAR EMBODIMENTS

In particular embodiments, a mobile computing device may log locationdata of user, and infer paths traveled by the user. The inferred pathsmay be ranked according by most-frequently-traveled or longest paths,and the ranked inferred paths may be provided to the user forconfirmation. Upon confirmation by the user, the inferred paths may bestored. As the mobile computing device is instructed by the user toprovide directions from point A to point B, the mobile computing devicemay calculate a route from point A to point B and provide a set ofturn-by-turn navigation instructions. In particular embodiments, the setof navigation instructions may be modified by replacing the navigationinstructions of at least some of the route with abbreviated navigationinstructions of one or more stored inferred paths. For example, if theroute includes segments A-C, C-D, and D-A, and the segment C-D thatcoincides with a stored path, the set of navigation instructions mayinclude detailed turn-by-turn navigation instructions for the segmentsA-C and D-A, while giving an abbreviated navigation instruction for thecoinciding segment C-D (e.g., “Now drive to D.”).

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an example network environment associated with asocial-networking system.

FIG. 2 illustrates an example mobile computing device.

FIG. 3 illustrates an example method for providing human-like navigationinstructions.

FIG. 4 illustrates an example social graph.

FIG. 5 illustrates an example computer system.

DESCRIPTION OF EXAMPLE EMBODIMENTS

FIG. 1 illustrates an example network environment 100 associated with asocial-networking system. Network environment 100 includes a user 101, aclient system 130, a social-networking system 160, and a third-partysystem 170 connected to each other by a network 110. Although FIG. 1illustrates a particular arrangement of user 101, client system 130,social-networking system 160, third-party system 170, and network 110,this disclosure contemplates any suitable arrangement of user 101,client system 130, social-networking system 160, third-party system 170,and network 110. As an example and not by way of limitation, two or moreof client system 130, social-networking system 160, and third-partysystem 170 may be connected to each other directly, bypassing network110. As another example, two or more of client system 130,social-networking system 160, and third-party system 170 may bephysically or logically co-located with each other in whole or in part.Moreover, although FIG. 1 illustrates a particular number of users 101,client systems 130, social-networking systems 160, third-party systems170, and networks 110, this disclosure contemplates any suitable numberof users 101, client systems 130, social-networking systems 160,third-party systems 170, and networks 110. As an example and not by wayof limitation, network environment 100 may include multiple users 101,client system 130, social-networking systems 160, third-party systems170, and networks 110.

In particular embodiments, user 101 may be an individual (human user),an entity (e.g., an enterprise, business, or third-party application),or a group (e.g., of individuals or entities) that interacts orcommunicates with or over social-networking system 160. In particularembodiments, social-networking system 160 may be a network-addressablecomputing system hosting an online social network. Social-networkingsystem 160 may generate, store, receive, and send social-networkingdata, such as, for example, user-profile data, concept-profile data,social-graph information, or other suitable data related to the onlinesocial network. Social-networking system 160 may be accessed by theother components of network environment 100 either directly or vianetwork 110. In particular embodiments, social-networking system 160 mayinclude an authorization server (or other suitable component(s)) thatallows users 101 to opt in to or opt out of having their actions loggedby social-networking system 160 or shared with other systems (e.g.,third-party systems 170), for example, by setting appropriate privacysettings. A privacy setting of a user may determine what informationassociated with the user may be logged, how information associated withthe user may be logged, when information associated with the user may belogged, who may log information associated with the user, whominformation associated with the user may be shared with, and for whatpurposes information associated with the user may be logged or shared.Authorization servers may be used to enforce one or more privacysettings of the users of social-networking system 30 through blocking,data hashing, anonymization, or other suitable techniques asappropriate. In particular embodiments, third-party system 170 may be anetwork-addressable computing system that can host websites orapplications. Third-party system 170 may generate, store, receive, andsend third-party system data, such as, for example, web pages, text,images, video, audio, or applications. Third-party system 170 may beaccessed by the other components of network environment 100 eitherdirectly or via network 110. In particular embodiments, one or moreusers 101 may use one or more client systems 130 to access, send datato, and receive data from social-networking system 160 or third-partysystem 170. Client system 130 may access social-networking system 160 orthird-party system 170 directly, via network 110, or via a third-partysystem. As an example and not by way of limitation, client system 130may access third-party system 170 via social-networking system 160.Client system 130 may be any suitable computing device, such as, forexample, a personal computer, a laptop computer, a cellular telephone, asmartphone, or a tablet computer.

This disclosure contemplates any suitable network 110. As an example andnot by way of limitation, one or more portions of network 110 mayinclude an ad hoc network, an intranet, an extranet, a virtual privatenetwork (VPN), a local area network (LAN), a wireless LAN (WLAN), a widearea network (WAN), a wireless WAN (WWAN), a metropolitan area network(MAN), a portion of the Internet, a portion of the Public SwitchedTelephone Network (PSTN), a cellular telephone network, or a combinationof two or more of these. Network 110 may include one or more networks110.

Links 150 may connect client system 130, social-networking system 160,and third-party system 170 to communication network 110 or to eachother. This disclosure contemplates any suitable links 150. Inparticular embodiments, one or more links 150 include one or morewireline (such as for example Digital Subscriber Line (DSL) or Data OverCable Service Interface Specification (DOCSIS)), wireless (such as forexample Wi-Fi or Worldwide Interoperability for Microwave Access(WiMAX)), or optical (such as for example Synchronous Optical Network(SONET) or Synchronous Digital Hierarchy (SDH)) links. In particularembodiments, one or more links 150 each include an ad hoc network, anintranet, an extranet, a VPN, a LAN, a WLAN, a WAN, a WWAN, a MAN, aportion of the Internet, a portion of the PSTN, a cellulartechnology-based network, a satellite communications technology-basednetwork, another link 150, or a combination of two or more such links150. Links 150 need not necessarily be the same throughout networkenvironment 100. One or more first links 150 may differ in one or morerespects from one or more second links 150.

In particular embodiments, social-networking system 160 may be anetwork-addressable computing system that can host an online socialnetwork. Social-networking system 160 may generate, store, receive, andsend social-networking data, such as, for example, user-profile data,concept-profile data, social-graph information, or other suitable datarelated to the online social network. Social-networking system 160 maybe accessed by the other components of network environment 100 eitherdirectly or via network 110. In particular embodiments,social-networking system 160 may include one or more servers. Eachserver may be a unitary server or a distributed server spanning multiplecomputers or multiple datacenters. The servers may be of various types,such as, for example and without limitation, web server, news server,mail server, message server, advertising server, file server,application server, exchange server, database server, proxy server,another server suitable for performing functions or processes describedherein, or any combination thereof. In particular embodiments, eachserver may include hardware, software, or embedded logic components or acombination of two or more such components for carrying out theappropriate functionalities implemented or supported by the servers. Inparticular embodiments, social-networking system 160 may include one ormore data stores. The data stores may be used to store various types ofinformation. In particular embodiments, the information stored in thedata stores may be organized according to specific data structures. Inparticular embodiments, each data store may be a relational, columnar,correlation, or other suitable database. Although this disclosuredescribes or illustrates particular types of databases, this disclosurecontemplates any suitable types of databases. Particular embodiments mayprovide interfaces that enable a client system 130, a social-networkingsystem 160, or a third-party system 170 to manage, retrieve, modify,add, or delete, the information stored in the data store.

In particular embodiments, social-networking system 160 or third-partysystem 170 may determine the current location of client system 130. Asan example and not by way of limitation, a route guidance applicationexecuted on client system 130 may send location data tosocial-networking 160 or third-party 170 system at pre-determinedintervals of time through network 110 using a wireless communicationprotocol such as for example, WI-FI or third-generation mobiletelecommunications (3G). In particular embodiments, social-networkingsystem 160 or third-party system 170 may poll or “ping” an applicationexecuted on client system 130 for location data by transmitting anactivation signal. In particular embodiments, location data of user 101sent to social-networking 160 or third-party 170 system may be stored inone or more data stores described above. In particular embodiments, aprogram (or a process) executed by one or more processors ofsocial-networking 160, third-party 170, client system 130, or anycombination thereof, may access the location data of the user 101.

In particular embodiments, one or more paths traveled by user 101 may beinferred based at least in part on the logged location data of user 101captured at pre-determined intervals over a pre-determined period oftime. As an example and not by way of limitation, paths traveled by user101 may be inferred by applying a machine learning algorithm such as forexample a neural network, support-vector machine (SVM), beliefpropagation, k-means algorithm, or hierarchical clustering, to thelogged location data of user 101. In particular embodiments, one or moreinferred paths may comprise a starting or ending geolocation. As anexample and not by way of limitation, starting or ending geolocationsmay correspond to a geolocation associated with a user node (e.g. aresidence) or concept node (e.g. place of business) of a social-graphdescribed below. In particular embodiments, the inferred paths of user101 may be associated with one or more abbreviated instructions that mayinclude the ending geolocation of the inferred path. In particularembodiments, each inferred path may comprise an abbreviated navigationinstruction to the ending geolocation. As an example and not by way oflimitation, the abbreviated navigation instruction of an inferred pathto a work location of the user may be a brief instruction to drive tothe geolocation of the workplace (e.g. “Drive toward your office”).Although this disclosure describes particular methods of inferring pathstraveled by the user, this disclosure contemplates any suitable methodof inferring a path traveled by a user, such as for example, the usermanually prompting logging of location data while traveling on aparticular path.

In particular embodiments, the inferred paths of user 101 may be rankedbased at least in part on one or more criteria. As an example and not byway of limitation, paths may be ranked based at least in part on theirrespective lengths. For example, longer paths may be assigned a higherranking relative to the ranking of shorter paths. As another example,inferred paths may be ranked based at least in part on respectivefrequencies the inferred paths are traveled by user 101. For example, aninferred path that was traveled 8 times by user 101 may be assigned ahigher ranking relative to another inferred path that was traveled 3times by user 101. As another example, the inferred paths may rankedbased at least in part on social proximities between the user or conceptnodes associated with the start or end geolocations and user 101. Forexample, a particular inferred path may ranked higher relative to otherrecorded paths if the particular recorded path's ending geolocationassociated with a first-degree connection of user 101, such as forexample a residence associated with a first-degree “friend” of user 101.As another example, may rank a particular recorded path higher relativeto other recorded paths if the particular recorded path's endinggeolocation corresponds to a user or concept node having an affinitycoefficient (with user 101) above a pre-determined threshold value.

In particular embodiments, one or more top ranked paths may be presentedto user 101 for confirmation. As an example and not by way oflimitation, client system 130 may present the top ranked paths to user101 as selectable icons (or selectable paths) in a graphical-userinterface (GUI) displayed on a display. User 101 may confirm particularpaths by selecting their corresponding icons on the GUI. In particularembodiments, user 101 may confirm one or more top ranked paths bysetting one or more configuration settings of client system 130. Inparticular embodiments, user 101 may assign one or more top ranked pathsas the user's favorite paths.

In particular embodiments, one or more top ranked paths (e.g., top 5ranked paths) may be stored in a data store. As an example and not byway of limitation, top ranked paths that are confirmed by the user maybe stored in a data store. Furthermore, the data store may be a localstorage component of client system 130 (e.g. a flash memory or a harddisk drive of the computing device), a data store of social-network 160or third-party 170 system, or any combination thereof. In particularembodiments, the top ranked paths stored in the data store may besynchronized among different client systems 130. In particularembodiments, client system 130 may store in a data store top rankedpaths together with a user identifier of the user. Client system 130 (oranother navigation device) may retrieve from the data store top rankedpaths specific for a requesting user 101 based on the requesting user'suser identifier.

FIG. 2 illustrates an example mobile computing device. As describedabove, a client system may be a mobile computing device 10. Inparticular embodiments, mobile computing device 10 may be a computingdevice, such as for example a smartphone, a tablet computer, or laptopcomputer, with capabilities determining location data based on globalpositioning system (GPS) signals, cellular triangulation, wirelesshotspots, or any suitable methods for determining location data, or astand-alone navigation device such as a portable GPS navigation system(e.g. developed by GARMIN or TOMTOM). In particular embodiments, mobilecomputing device 10 may be included in an in-car (e.g. dashboard)navigation system of a vehicle. In particular embodiments, a routeguidance application executed on mobile computing device 10 may sendlocation data to a social-networking or third-party system atpre-determined intervals. In particular embodiments, an application maytransmit location data to the social-networking or third-party system inresponse receiving an activation signal, as described above. Inparticular embodiments, the location service of mobile computing device10 may use one or more methods of location determination, such as forexample, using the location of one or more cellular towers,crowd-sourced location information associated with a WI-FI hotspot, or aGPS function of mobile computing device 10. As an example and not by wayof limitation, the application may use GPS data as the primary source oflocation information depending at least in part on whether mobilecomputing device 10 is able to acquire GPS data within a pre-determinedperiod of time. As another example, if mobile computing device 10 isunable to acquire the GPS data within the pre-determined samplingduration, the application may use the location determined using one ormore cellular towers or WI-FI hotspots. Although this disclosuredescribes a location service using particular methods of locationdetermination, this disclosure contemplates a location service using anysuitable method or combination of methods of location detection.

In particular embodiments, a route guidance application executed onmobile computing device 10 may receive a request from a user for a routeto a destination, calculate the route to the destination, and providenavigation of the route to the destination. The route may include one ormore segments that each correspond to a portion of the route.Furthermore, each segment may include “turn-by-turn” or navigationinstructions to an endpoint of each segment. As described below, theroute guidance application executed on mobile computing device 10 maycalculate a route toward a destination and identify one or more inferredpaths of the user, described above, that coincide with one or moresegments of the route. As an example and not by way of limitation,mobile computing device 10 may identify one or more inferred paths thatcoincide with one or more segments of the route based at least in parton accessing the stored inferred paths of the user described above. Asdescribed below, the route-guidance application may replace thenavigation instructions the abbreviated instructions for the particularinferred paths (that the user is already familiar with), while providingmore detailed instructions for rest of the route that is not modified bythe particular inferred paths. For example, the calculated route mayinclude an intermediate point that is the user's work location. Incomparison, another person, knowing that the user already knows how toget to a work location of the user, may only provide a abbreviatednavigation instruction (e.g. “Drive toward your home”).

FIG. 3 illustrates an example method for providing human-like navigationinstructions. The method 400 of FIG. 3 may be implemented by a computingdevice. The method 400 of FIG. 3 may be implemented by a program (or aprocess) executed by one or more processors of the computing device. Thecomputing device may be a portable GPS navigation system, a mobiledevice, or a in-car navigation system as described earlier. The method400 of FIG. 3 may begin at step 410. In particular embodiments, at step410, the computing device may receive from a user a request for adirection from a first location to a second location. For example, thecomputing device may receive from the user a request for a direction to100 University Avenue, Palo Alto, Calif. (i.e., the second location)from the user's current location (i.e., the first location). The usermay provide to the computing device information for the second locationby entering the second location in a graphical user interface displayedin a display of the computing device. The user may provide to thecomputing device information for the second location by vocal commands.The user may also provide to the computing device information for thefirst location (e.g., if the first location is different from the user'scurrent location).

In particular embodiments, at step 420, the computing device maycalculate a route from the first location to the second location. Inparticular embodiments, the route may comprise one or more segments anda set of navigation instructions of the segments. For example, theuser's current location (the first location) may be 100 Main Street,Pleasanton, Calif. The second location may be 100 University Avenue,Palo Alto, Calif. The computing device may calculate a route comprisingeight segments: the first segment from 100 Main Street, Pleasanton,Calif. to Sunol Boulevard; the second segment continues on SunolBoulevard to an on-ramp onto Interstate 680 South-bound; the thirdsegment continues on Interstate 680 South-bound to an exit to MissionBoulevard; the fourth segment continues on Mission Boulevard to anintersection with Interstate 880 South-bound; the fifth segmentcontinues on Interstate 880 South-bound to an intersection withCalifornia State Route 237 West-bound; the sixth segment continues onCalifornia State Route 237 West-bound to an intersection with US-101North-bound, the seventh segment continues on US-101 North-bound to anexit to University Avenue; and the eighth segment continues onUniversity Avenue to 200 University Avenue (i.e., the second location).

In particular embodiments, at step 430, the computing device may accessa data store for one or more inferred paths, as described above. Inparticular embodiments, the paths may be inferred based on previouslocation data of the user. For example, the inferred paths may befrequently traveled paths or highly ranked paths of the user, asdescribed above. The computing device may access a local storage for theinferred paths. The computing device may access a remote data store(e.g., of a social-networking or third-party system illustrated in theexample of FIG. 1) for the inferred paths. The computing device mayidentify the user and access a data store for inferred paths specific tothe user. As described above, each inferred path may include anabbreviated navigation instruction that may include an endinggeolocation associated with the user. In particular embodiments, thecomputing device such as an in-car navigation system may identify thedriver by the driver's key fob (or by the driver's voice), and retrievefrom a data store inferred paths specific to the user (e.g., based on auser identifier of the user).

At step 440, the computing device may identify one or more inferredpaths that coincide with one or more of the segments. As an example andnot by way of limitation, a particular pre-determined path for the usermay travel from the intersection of Interstate 680 South-bound and SunolBoulevard, continuing on Interstate 680 South-bound and MissionBoulevard to California State Route 237 West-bound, and end at theintersection of California State Route 237 West-bound and US-101North-bound may be identified as coinciding with one or more segments ofthe calculated route described above. For example, the computing devicemay identify that the particular inferred path (that starts onInterstate 680 South-bound at the intersection with Sunol Boulevard andends at the intersection California State Route 237 West-bound andUS-101 North-bound) coincides with the second through sixth segments ofthe calculated route described above. In particular embodiments, apreviously calculated segment may re-calculated (e.g. adding one or moresegments) if the starting or ending geolocation of the inferred pathdoes not coincide with the start or end location of a previouslycalculated segment.

Step 450, by the computing device, modifies the set of navigationinstructions by replacing the navigation instructions of the coincidingsegments with the abbreviated navigation instruction of each identifiedinferred path. As an example and not by way of limitation, thenavigation instructions of the second through sixth segments, describedabove, may be replaced with the abbreviated navigation instruction ofthe identified inferred path, such as for example “drive toward US-101North-bound.” At step 460, the computing device may provide the set ofnavigation instructions to the user. In particular embodiments, thedirection from the first location to the second location may compriseone or more navigation instructions for the segments. For example, anthe example modified set of navigation instructions of the route from100 Main Street, Pleasanton, Calif. to 200 University Avenue, Palo Alto,Calif., described above, may include turn-by-turn instructions for thesegments from 100 Main Street, Pleasanton, Calif. to an on-ramp ontoInterstate 680 South-bound: “head south on Main Street toward BernalAve; turn left onto Bernal Avenue; take the first right onto firststreet; continue onto Sunol Boulevard; merge onto Interstate 680South-bound toward San Jose.” The modified set of navigationinstructions may continue with an abbreviated navigation instruction ofan identified inferred path that coincides with one or more segments:“drive toward US-101 North-bound.” The modified set of navigationinstructions may continue with turn-by-turn instructions from theintersection California State Route 237 West-bound and US-101North-bound to the destination: “take the exit onto US-101 North-boundtoward San Francisco; exit onto University Avenue; you have reached yourdestination on your left.”

Particular embodiments may repeat one or more steps of the method ofFIG. 3, where appropriate. Although this disclosure describes andillustrates particular steps of the method of FIG. 3 as occurring in aparticular order, this disclosure contemplates any suitable steps of themethod of FIG. 3 occurring in any suitable order. Moreover, althoughthis disclosure describes and illustrates an example method forproviding human-like navigation directions including the particularsteps of the method of FIG. 3, this disclosure contemplates any suitablemethod for providing human-like navigation directions including anysuitable steps, which may include all, some, or none of the steps of themethod of FIG. 3, where appropriate. Furthermore, although thisdisclosure describes and illustrates particular components, devices, orsystems carrying out particular steps of the method of FIG. 3, thisdisclosure contemplates any suitable combination of any suitablecomponents, devices, or systems carrying out any suitable steps of themethod of FIG. 3.

FIG. 4 illustrates example social graph 200. In particular embodiments,social-networking system 160 may store one or more social graphs 200 inone or more data stores. In particular embodiments, social graph 200 mayinclude multiple nodes—which may include multiple user nodes 202 ormultiple concept nodes 204—and multiple edges 206 connecting the nodes.Example social graph 200 illustrated in FIG. 4 is shown, for didacticpurposes, in a two-dimensional visual map representation. In particularembodiments, a social-networking system 160, client system 130, orthird-party system 170 may access social graph 200 and relatedsocial-graph information for suitable applications. The nodes and edgesof social graph 200 may be stored as data objects, for example, in adata store (such as a social-graph database). Such a data store mayinclude one or more searchable or queryable indexes of nodes or edges ofsocial graph 200.

In particular embodiments, a user node 202 may correspond to a user ofsocial-networking system 160. As an example and not by way oflimitation, a user may be an individual (human user), an entity (e.g.,an enterprise, business, or third-party application), or a group (e.g.,of individuals or entities) that interacts or communicates with or oversocial-networking system 160. In particular embodiments, when a userregisters for an account with social-networking system 160,social-networking system 160 may create a user node 202 corresponding tothe user, and store the user node 202 in one or more data stores. Usersand user nodes 202 described herein may, where appropriate, refer toregistered users and user nodes 202 associated with registered users. Inaddition or as an alternative, users and user nodes 202 described hereinmay, where appropriate, refer to users that have not registered withsocial-networking system 160. In particular embodiments, a user node 202may be associated with information provided by a user or informationgathered by various systems, including social-networking system 160. Asan example and not by way of limitation, a user may provide his or hername, profile picture, contact information, birth date, sex, maritalstatus, family status, employment, education background, preferences,interests, or other demographic information. In particular embodiments,a user node 202 may be associated with one or more data objectscorresponding to information associated with a user. In particularembodiments, a user node 202 may correspond to one or more webpages.

In particular embodiments, a concept node 204 may correspond to aconcept. As an example and not by way of limitation, a concept maycorrespond to a place (such as, for example, a movie theater,restaurant, landmark, or city); a website (such as, for example, awebsite associated with social-network system 160 or a third-partywebsite associated with a web-application server); an entity (such as,for example, a person, business, group, sports team, or celebrity); aresource (such as, for example, an audio file, video file, digitalphoto, text file, structured document, or application) which may belocated within social-networking system 160 or on an external server,such as a web-application server; real or intellectual property (suchas, for example, a sculpture, painting, movie, game, song, idea,photograph, or written work); a game; an activity; an idea or theory;another suitable concept; or two or more such concepts. A concept node204 may be associated with information of a concept provided by a useror information gathered by various systems, including social-networkingsystem 160. As an example and not by way of limitation, information of aconcept may include a name or a title; one or more images (e.g., animage of the cover page of a book); a location (e.g., an address or ageographical location); a website (which may be associated with a URL);contact information (e.g., a phone number or an email address); othersuitable concept information; or any suitable combination of suchinformation. In particular embodiments, a concept node 204 may beassociated with one or more data objects corresponding to informationassociated with concept node 204. In particular embodiments, a conceptnode 204 may correspond to one or more webpages.

In particular embodiments, a node in social graph 200 may represent orbe represented by a webpage (which may be referred to as a “profilepage”). Profile pages may be hosted by or accessible tosocial-networking system 160. Profile pages may also be hosted onthird-party websites associated with a third-party server 170. As anexample and not by way of limitation, a profile page corresponding to aparticular external webpage may be the particular external webpage andthe profile page may correspond to a particular concept node 204.Profile pages may be viewable by all or a selected subset of otherusers. As an example and not by way of limitation, a user node 202 mayhave a corresponding user-profile page in which the corresponding usermay add content, make declarations, or otherwise express himself orherself. As another example and not by way of limitation, a concept node204 may have a corresponding concept-profile page in which one or moreusers may add content, make declarations, or express themselves,particularly in relation to the concept corresponding to concept node204.

In particular embodiments, a concept node 204 may represent athird-party webpage or resource hosted by a third-party system 170. Thethird-party webpage or resource may include, among other elements,content, a selectable or other icon, or other inter-actable object(which may be implemented, for example, in JavaScript, AJAX, or PHPcodes) representing an action or activity. As an example and not by wayof limitation, a third-party webpage may include a selectable icon suchas “like,” “check in,” “eat,” “recommend,” or another suitable action oractivity. A user viewing the third-party webpage may perform an actionby selecting one of the icons (e.g., “eat”), causing a client system 130to send to social-networking system 160 a message indicating the user'saction. In response to the message, social-networking system 160 maycreate an edge (e.g., an “eat” edge) between a user node 202corresponding to the user and a concept node 204 corresponding to thethird-party webpage or resource and store edge 206 in one or more datastores.

In particular embodiments, a pair of nodes in social graph 200 may beconnected to each other by one or more edges 206. An edge 206 connectinga pair of nodes may represent a relationship between the pair of nodes.In particular embodiments, an edge 206 may include or represent one ormore data objects or attributes corresponding to the relationshipbetween a pair of nodes. As an example and not by way of limitation, afirst user may indicate that a second user is a “friend” of the firstuser. In response to this indication, social-networking system 160 maysend a “friend request” to the second user. If the second user confirmsthe “friend request,” social-networking system 160 may create an edge206 connecting the first user's user node 202 to the second user's usernode 202 in social graph 200 and store edge 206 as social-graphinformation in one or more of data stores 164. In the example of FIG. 4,social graph 200 includes an edge 206 indicating a friend relationbetween user nodes 202 of user “A” and user “B” and an edge indicating afriend relation between user nodes 202 of user “C” and user “B.”Although this disclosure describes or illustrates particular edges 206with particular attributes connecting particular user nodes 202, thisdisclosure contemplates any suitable edges 206 with any suitableattributes connecting user nodes 202. As an example and not by way oflimitation, an edge 206 may represent a friendship, family relationship,business or employment relationship, fan relationship, followerrelationship, visitor relationship, subscriber relationship,superior/subordinate relationship, reciprocal relationship,non-reciprocal relationship, another suitable type of relationship, ortwo or more such relationships. Moreover, although this disclosuregenerally describes nodes as being connected, this disclosure alsodescribes users or concepts as being connected. Herein, references tousers or concepts being connected may, where appropriate, refer to thenodes corresponding to those users or concepts being connected in socialgraph 200 by one or more edges 206.

In particular embodiments, an edge 206 between a user node 202 and aconcept node 204 may represent a particular action or activity performedby a user associated with user node 202 toward a concept associated witha concept node 204. As an example and not by way of limitation, asillustrated in FIG. 4, a user may “like,” “attended,” “played,”“listened,” “cooked,” “worked at,” or “watched” a concept, each of whichmay correspond to a edge type or subtype. A concept-profile pagecorresponding to a concept node 204 may include, for example, aselectable “check in” icon (such as, for example, a clickable “check in”icon) or a selectable “add to favorites” icon. Similarly, after a userclicks these icons, social-networking system 160 may create a “favorite”edge or a “check in” edge in response to a user's action correspondingto a respective action. As another example and not by way of limitation,a user (user “C”) may listen to a particular song (“Imagine”) using aparticular application (SPOTIFY, which is an online music application).In this case, social-networking system 160 may create a “listened” edge206 and a “used” edge (as illustrated in FIG. 4) between user nodes 202corresponding to the user and concept nodes 204 corresponding to thesong and application to indicate that the user listened to the song andused the application. Moreover, social-networking system 160 may createa “played” edge 206 (as illustrated in FIG. 4) between concept nodes 204corresponding to the song and the application to indicate that theparticular song was played by the particular application. In this case,“played” edge 206 corresponds to an action performed by an externalapplication (SPOTIFY) on an external audio file (the song “Imagine”).Although this disclosure describes particular edges 206 with particularattributes connecting user nodes 202 and concept nodes 204, thisdisclosure contemplates any suitable edges 206 with any suitableattributes connecting user nodes 202 and concept nodes 204. Moreover,although this disclosure describes edges between a user node 202 and aconcept node 204 representing a single relationship, this disclosurecontemplates edges between a user node 202 and a concept node 204representing one or more relationships. As an example and not by way oflimitation, an edge 206 may represent both that a user likes and hasused at a particular concept. Alternatively, another edge 206 mayrepresent each type of relationship (or multiples of a singlerelationship) between a user node 202 and a concept node 204 (asillustrated in FIG. 4 between user node 202 for user “E” and conceptnode 204 for “SPOTIFY”).

In particular embodiments, social-networking system 160 may create anedge 206 between a user node 202 and a concept node 204 in social graph200. As an example and not by way of limitation, a user viewing aconcept-profile page (such as, for example, by using a web browser or aspecial-purpose application hosted by the user's client system 130) mayindicate that he or she likes the concept represented by the conceptnode 204 by clicking or selecting a “Like” icon, which may cause theuser's client system 130 to send to social-networking system 160 amessage indicating the user's liking of the concept associated with theconcept-profile page. In response to the message, social-networkingsystem 160 may create an edge 206 between user node 202 associated withthe user and concept node 204, as illustrated by “like” edge 206 betweenthe user and concept node 204. In particular embodiments,social-networking system 160 may store an edge 206 in one or more datastores. In particular embodiments, an edge 206 may be automaticallyformed by social-networking system 160 in response to a particular useraction. As an example and not by way of limitation, if a first useruploads a picture, watches a movie, or listens to a song, an edge 206may be formed between user node 202 corresponding to the first user andconcept nodes 204 corresponding to those concepts. Although thisdisclosure describes forming particular edges 206 in particular manners,this disclosure contemplates forming any suitable edges 206 in anysuitable manner.

In particular embodiments, social-networking system 160 may determinethe social-graph affinity (which may be referred to herein as“affinity”) of various social-graph entities for each other. Affinitymay represent the strength of a relationship or level of interestbetween particular objects associated with the online social network,such as users, concepts, content, actions, advertisements, other objectsassociated with the online social network, or any suitable combinationthereof. Affinity may also be determined with respect to objectsassociated with third-party systems 170 or other suitable systems. Anoverall affinity for a social-graph entity for each user, subjectmatter, or type of content may be established. The overall affinity maychange based on continued monitoring of the actions or relationshipsassociated with the social-graph entity. Although this disclosuredescribes determining particular affinities in a particular manner, thisdisclosure contemplates determining any suitable affinities in anysuitable manner.

In particular embodiments, social-networking system 160 may measure orquantify social-graph affinity using an affinity coefficient (which maybe referred to herein as “coefficient”). The coefficient may representor quantify the strength of a relationship between particular objectsassociated with the online social network. The coefficient may alsorepresent a probability or function that measures a predictedprobability that a user will perform a particular action based on theuser's interest in the action. In this way, a user's future actions maybe predicted based on the user's prior actions, where the coefficientmay be calculated at least in part a the history of the user's actions.Coefficients may be used to predict any number of actions, which may bewithin or outside of the online social network. As an example and not byway of limitation, these actions may include various types ofcommunications, such as sending messages, posting content, or commentingon content; various types of a observation actions, such as accessing orviewing profile pages, media, or other suitable content; various typesof coincidence information about two or more social-graph entities, suchas being in the same group, tagged in the same photograph, checked-in atthe same location, or attending the same event; or other suitableactions. Although this disclosure describes measuring affinity in aparticular manner, this disclosure contemplates measuring affinity inany suitable manner.

In particular embodiments, social-networking system 160 may use avariety of factors to calculate a coefficient. These factors mayinclude, for example, user actions, types of relationships betweenobjects, location information, other suitable factors, or anycombination thereof. In particular embodiments, different factors may beweighted differently when calculating the coefficient. The weights foreach factor may be static or the weights may change according to, forexample, the user, the type of relationship, the type of action, theuser's location, and so forth. Ratings for the factors may be combinedaccording to their weights to determine an overall coefficient for theuser. As an example and not by way of limitation, particular useractions may be assigned both a rating and a weight while a relationshipassociated with the particular user action is assigned a rating and acorrelating weight (e.g., so the weights total 100%). To calculate thecoefficient of a user towards a particular object, the rating assignedto the user's actions may comprise, for example, 60% of the overallcoefficient, while the relationship between the user and the object maycomprise 40% of the overall coefficient. In particular embodiments, thesocial-networking system 160 may consider a variety of variables whendetermining weights for various factors used to calculate a coefficient,such as, for example, the time since information was accessed, decayfactors, frequency of access, relationship to information orrelationship to the object about which information was accessed,relationship to social-graph entities connected to the object, short- orlong-term averages of user actions, user feedback, other suitablevariables, or any combination thereof. As an example and not by way oflimitation, a coefficient may include a decay factor that causes thestrength of the signal provided by particular actions to decay withtime, such that more recent actions are more relevant when calculatingthe coefficient. The ratings and weights may be continuously updatedbased on continued tracking of the actions upon which the coefficient isbased. Any type of process or algorithm may be employed for assigning,combining, averaging, and so forth the ratings for each factor and theweights assigned to the factors. In particular embodiments,social-networking system 160 may determine coefficients usingmachine-learning algorithms trained on historical actions and past userresponses, or data farmed from users by exposing them to various optionsand measuring responses. Although this disclosure describes calculatingcoefficients in a particular manner, this disclosure contemplatescalculating coefficients in any suitable manner.

In particular embodiments, social-networking system 160 may calculate acoefficient based on a user's actions. Social-networking system 160 maymonitor such actions on the online social network, on a third-partysystem 170, on other suitable systems, or any combination thereof. Anysuitable type of user actions may be tracked or monitored. Typical useractions include viewing profile pages, creating or posting content,interacting with content, tagging or being tagged in images, joininggroups, listing and confirming attendance at events, checking-in atlocations, liking particular pages, creating pages, and performing othertasks that facilitate social action. In particular embodiments,social-networking system 160 may calculate a coefficient based on theuser's actions with particular types of content. The content may beassociated with the online social network, a third-party system 170, oranother suitable system. The content may include users, profile pages,posts, news stories, headlines, instant messages, chat roomconversations, emails, advertisements, pictures, video, music, othersuitable objects, or any combination thereof. Social-networking system160 may analyze a user's actions to determine whether one or more of theactions indicate an affinity for subject matter, content, other users,and so forth. As an example and not by way of limitation, if a user maymake frequently posts content related to “coffee” or variants thereof,social-networking system 160 may determine the user has a highcoefficient with respect to the concept “coffee”. Particular actions ortypes of actions may be assigned a higher weight and/or rating thanother actions, which may affect the overall calculated coefficient. Asan example and not by way of limitation, if a first user emails a seconduser, the weight or the rating for the action may be higher than if thefirst user simply views the user-profile page for the second user.

In particular embodiments, social-networking system 160 may calculate acoefficient based on the type of relationship between particularobjects. Referencing the social graph 200, social-networking system 160may analyze the number and/or type of edges 206 connecting particularuser nodes 202 and concept nodes 204 when calculating a coefficient. Asan example and not by way of limitation, user nodes 202 that areconnected by a spouse-type edge (representing that the two users aremarried) may be assigned a higher coefficient than a user nodes 202 thatare connected by a friend-type edge. In other words, depending upon theweights assigned to the actions and relationships for the particularuser, the overall affinity may be determined to be higher for contentabout the user's spouse than for content about the user's friend. Inparticular embodiments, the relationships a user has with another objectmay affect the weights and/or the ratings of the user's actions withrespect to calculating the coefficient for that object. As an exampleand not by way of limitation, if a user is tagged in first photo, butmerely likes a second photo, social-networking system 160 may determinethat the user has a higher coefficient with respect to the first photothan the second photo because having a tagged-in-type relationship withcontent may be assigned a higher weight and/or rating than having alike-type relationship with content. In particular embodiments,social-networking system 160 may calculate a coefficient for a firstuser based on the relationship one or more second users have with aparticular object. In other words, the connections and coefficientsother users have with an object may affect the first user's coefficientfor the object. As an example and not by way of limitation, if a firstuser is connected to or has a high coefficient for one or more secondusers, and those second users are connected to or have a highcoefficient for a particular object, social-networking system 160 maydetermine that the first user should also have a relatively highcoefficient for the particular object. In particular embodiments, thecoefficient may be based on the degree of separation between particularobjects. The lower coefficient may represent the decreasing likelihoodthat the first user will share an interest in content objects of theuser that is indirectly connected to the first user in the social graph200. As an example and not by way of limitation, social-graph entitiesthat are closer in the social graph 200 (i.e., fewer degrees ofseparation) may have a higher coefficient than entities that are furtherapart in the social graph 200.

In particular embodiments, social-networking system 160 may calculate acoefficient based on location information. Objects that aregeographically closer to each other may be considered to be more relatedor of more interest to each other than more distant objects. Inparticular embodiments, the coefficient of a user towards a particularobject may be based on the proximity of the object's location to acurrent location associated with the user (or the location of a clientsystem 130 of the user). A first user may be more interested in otherusers or concepts that are closer to the first user. As an example andnot by way of limitation, if a user is one mile from an airport and twomiles from a gas station, social-networking system 160 may determinethat the user has a higher coefficient for the airport than the gasstation based on the proximity of the airport to the user.

In particular embodiments, social-networking system 160 may performparticular actions with respect to a user based on coefficientinformation. Coefficients may be used to predict whether a user willperform a particular action based on the user's interest in the action.A coefficient may be used when generating or presenting any type ofobjects to a user, such as advertisements, search results, news stories,media, messages, notifications, or other suitable objects. Thecoefficient may also be utilized to rank and order such objects, asappropriate. In this way, social-networking system 160 may provideinformation that is relevant to user's interests and currentcircumstances, increasing the likelihood that they will find suchinformation of interest. In particular embodiments, social-networkingsystem 160 may generate content based on coefficient information.Content objects may be provided or selected based on coefficientsspecific to a user. As an example and not by way of limitation, thecoefficient may be used to generate media for the user, where the usermay be presented with media for which the user has a high overallcoefficient with respect to the media object. As another example and notby way of limitation, the coefficient may be used to generateadvertisements for the user, where the user may be presented withadvertisements for which the user has a high overall coefficient withrespect to the advertised object. In particular embodiments,social-networking system 160 may generate search results based oncoefficient information. Search results for a particular user may bescored or ranked based on the coefficient associated with the searchresults with respect to the querying user. As an example and not by wayof limitation, search results corresponding to objects with highercoefficients may be ranked higher on a search-results page than resultscorresponding to objects having lower coefficients.

In particular embodiments, social-networking system 160 may calculate acoefficient in response to a request for a coefficient from a particularsystem or process. To predict the likely actions a user may take (or maybe the subject of) in a given situation, any process may request acalculated coefficient for a user. The request may also include a set ofweights to use for various factors used to calculate the coefficient.This request may come from a process running on the online socialnetwork, from a third-party system 170 (e.g., via an API or othercommunication channel), or from another suitable system. In response tothe request, social-networking system 160 may calculate the coefficient(or access the coefficient information if it has previously beencalculated and stored). In particular embodiments, social-networkingsystem 160 may measure an affinity with respect to a particular process.Different processes (both internal and external to the online socialnetwork) may request a coefficient for a particular object or set ofobjects. Social-networking system 160 may provide a measure of affinitythat is relevant to the particular process that requested the measure ofaffinity. In this way, each process receives a measure of affinity thatis tailored for the different context in which the process will use themeasure of affinity.

In connection with social-graph affinity and affinity coefficients,particular embodiments may utilize one or more systems, components,elements, functions, methods, operations, or steps disclosed in U.S.patent application Ser. No. 11/503,093, filed 11 Aug. 2006, U.S. patentapplication Ser. No. 12/977,027, filed 22 Dec. 2010, U.S. patentapplication Ser. No. 12/978,265, filed 23 Dec. 2010, and U.S. patentapplication Ser. No. 13/632,869, field 1 Oct. 2012, each of which isincorporated by reference.

FIG. 5 illustrates an example computer system 500. In particularembodiments, one or more computer systems 500 perform one or more stepsof one or more methods described or illustrated herein. In particularembodiments, one or more computer systems 500 provide functionalitydescribed or illustrated herein. In particular embodiments, softwarerunning on one or more computer systems 500 performs one or more stepsof one or more methods described or illustrated herein or providesfunctionality described or illustrated herein. Particular embodimentsinclude one or more portions of one or more computer systems 500.Herein, reference to a computer system may encompass a computing device,and vice versa, where appropriate. Moreover, reference to a computersystem may encompass one or more computer systems, where appropriate.

This disclosure contemplates any suitable number of computer systems500. This disclosure contemplates computer system 500 taking anysuitable physical form. As example and not by way of limitation,computer system 500 may be an embedded computer system, a system-on-chip(SOC), a single-board computer system (SBC) (such as, for example, acomputer-on-module (COM) or system-on-module (SOM)), a desktop computersystem, a laptop or notebook computer system, an interactive kiosk, amainframe, a mesh of computer systems, a mobile telephone, a personaldigital assistant (PDA), a server, a tablet computer system, or acombination of two or more of these. Where appropriate, computer system500 may include one or more computer systems 500; be unitary ordistributed; span multiple locations; span multiple machines; spanmultiple data centers; or reside in a cloud, which may include one ormore cloud components in one or more networks. Where appropriate, one ormore computer systems 500 may perform without substantial spatial ortemporal limitation one or more steps of one or more methods describedor illustrated herein. As an example and not by way of limitation, oneor more computer systems 500 may perform in real time or in batch modeone or more steps of one or more methods described or illustratedherein. One or more computer systems 500 may perform at different timesor at different locations one or more steps of one or more methodsdescribed or illustrated herein, where appropriate.

In particular embodiments, computer system 500 includes a processor 502,memory 504, storage 506, an input/output (I/O) interface 508, acommunication interface 510, and a bus 512. Although this disclosuredescribes and illustrates a particular computer system having aparticular number of particular components in a particular arrangement,this disclosure contemplates any suitable computer system having anysuitable number of any suitable components in any suitable arrangement.

In particular embodiments, processor 502 includes hardware for executinginstructions, such as those making up a computer program. As an exampleand not by way of limitation, to execute instructions, processor 502 mayretrieve (or fetch) the instructions from an internal register, aninternal cache, memory 504, or storage 506; decode and execute them; andthen write one or more results to an internal register, an internalcache, memory 504, or storage 506. In particular embodiments, processor502 may include one or more internal caches for data, instructions, oraddresses. This disclosure contemplates processor 502 including anysuitable number of any suitable internal caches, where appropriate. Asan example and not by way of limitation, processor 502 may include oneor more instruction caches, one or more data caches, and one or moretranslation lookaside buffers (TLBs). Instructions in the instructioncaches may be copies of instructions in memory 504 or storage 506, andthe instruction caches may speed up retrieval of those instructions byprocessor 502. Data in the data caches may be copies of data in memory504 or storage 506 for instructions executing at processor 502 tooperate on; the results of previous instructions executed at processor502 for access by subsequent instructions executing at processor 502 orfor writing to memory 504 or storage 506; or other suitable data. Thedata caches may speed up read or write operations by processor 502. TheTLBs may speed up virtual-address translation for processor 502. Inparticular embodiments, processor 502 may include one or more internalregisters for data, instructions, or addresses. This disclosurecontemplates processor 502 including any suitable number of any suitableinternal registers, where appropriate. Where appropriate, processor 502may include one or more arithmetic logic units (ALUs); be a multi-coreprocessor; or include one or more processors 502. Although thisdisclosure describes and illustrates a particular processor, thisdisclosure contemplates any suitable processor.

In particular embodiments, memory 504 includes main memory for storinginstructions for processor 502 to execute or data for processor 502 tooperate on. As an example and not by way of limitation, computer system500 may load instructions from storage 506 or another source (such as,for example, another computer system 500) to memory 504. Processor 502may then load the instructions from memory 504 to an internal registeror internal cache. To execute the instructions, processor 502 mayretrieve the instructions from the internal register or internal cacheand decode them. During or after execution of the instructions,processor 502 may write one or more results (which may be intermediateor final results) to the internal register or internal cache. Processor502 may then write one or more of those results to memory 504. Inparticular embodiments, processor 502 executes only instructions in oneor more internal registers or internal caches or in memory 504 (asopposed to storage 506 or elsewhere) and operates only on data in one ormore internal registers or internal caches or in memory 504 (as opposedto storage 506 or elsewhere). One or more memory buses (which may eachinclude an address bus and a data bus) may couple processor 502 tomemory 504. Bus 512 may include one or more memory buses, as describedbelow. In particular embodiments, one or more memory management units(MMUs) reside between processor 502 and memory 504 and facilitateaccesses to memory 504 requested by processor 502. In particularembodiments, memory 504 includes random access memory (RAM). This RAMmay be volatile memory, where appropriate Where appropriate, this RAMmay be dynamic RAM (DRAM) or static RAM (SRAM). Moreover, whereappropriate, this RAM may be single-ported or multi-ported RAM. Thisdisclosure contemplates any suitable RAM. Memory 504 may include one ormore memories 504, where appropriate. Although this disclosure describesand illustrates particular memory, this disclosure contemplates anysuitable memory.

In particular embodiments, storage 506 includes mass storage for data orinstructions. As an example and not by way of limitation, storage 506may include a hard disk drive (HDD), a floppy disk drive, flash memory,an optical disc, a magneto-optical disc, magnetic tape, or a UniversalSerial Bus (USB) drive or a combination of two or more of these. Storage506 may include removable or non-removable (or fixed) media, whereappropriate. Storage 506 may be internal or external to computer system500, where appropriate. In particular embodiments, storage 506 isnon-volatile, solid-state memory. In particular embodiments, storage 506includes read-only memory (ROM). Where appropriate, this ROM may bemask-programmed ROM, programmable ROM (PROM), erasable PROM (EPROM),electrically erasable PROM (EEPROM), electrically alterable ROM (EAROM),or flash memory or a combination of two or more of these. Thisdisclosure contemplates mass storage 506 taking any suitable physicalform. Storage 506 may include one or more storage control unitsfacilitating communication between processor 502 and storage 506, whereappropriate. Where appropriate, storage 506 may include one or morestorages 506. Although this disclosure describes and illustratesparticular storage, this disclosure contemplates any suitable storage.

In particular embodiments, I/O interface 508 includes hardware,software, or both, providing one or more interfaces for communicationbetween computer system 500 and one or more I/O devices. Computer system500 may include one or more of these I/O devices, where appropriate. Oneor more of these I/O devices may enable communication between a personand computer system 500. As an example and not by way of limitation, anI/O device may include a keyboard, keypad, microphone, monitor, mouse,printer, scanner, speaker, still camera, stylus, tablet, touch screen,trackball, video camera, another suitable I/O device or a combination oftwo or more of these. An I/O device may include one or more sensors.This disclosure contemplates any suitable I/O devices and any suitableI/O interfaces 508 for them. Where appropriate, I/O interface 508 mayinclude one or more device or software drivers enabling processor 502 todrive one or more of these I/O devices. I/O interface 508 may includeone or more I/O interfaces 508, where appropriate. Although thisdisclosure describes and illustrates a particular I/O interface, thisdisclosure contemplates any suitable I/O interface.

In particular embodiments, communication interface 510 includeshardware, software, or both providing one or more interfaces forcommunication (such as, for example, packet-based communication) betweencomputer system 500 and one or more other computer systems 500 or one ormore networks. As an example and not by way of limitation, communicationinterface 510 may include a network interface controller (NIC) ornetwork adapter for communicating with an Ethernet or other wire-basednetwork or a wireless NIC (WNIC) or wireless adapter for communicatingwith a wireless network, such as a WI-FI network. This disclosurecontemplates any suitable network and any suitable communicationinterface 510 for it. As an example and not by way of limitation,computer system 500 may communicate with an ad hoc network, a personalarea network (PAN), a local area network (LAN), a wide area network(WAN), a metropolitan area network (MAN), or one or more portions of theInternet or a combination of two or more of these. One or more portionsof one or more of these networks may be wired or wireless. As anexample, computer system 500 may communicate with a wireless PAN (WPAN)(such as, for example, a BLUETOOTH WPAN), a WI-FI network, a WI-MAXnetwork, a cellular telephone network (such as, for example, a GlobalSystem for Mobile Communications (GSM) network), or other suitablewireless network or a combination of two or more of these. Computersystem 500 may include any suitable communication interface 510 for anyof these networks, where appropriate. Communication interface 510 mayinclude one or more communication interfaces 510, where appropriate.Although this disclosure describes and illustrates a particularcommunication interface, this disclosure contemplates any suitablecommunication interface.

In particular embodiments, bus 512 includes hardware, software, or bothcoupling components of computer system 500 to each other. As an exampleand not by way of limitation, bus 512 may include an AcceleratedGraphics Port (AGP) or other graphics bus, an Enhanced Industry StandardArchitecture (EISA) bus, a front-side bus (FSB), a HYPERTRANSPORT (HT)interconnect, an Industry Standard Architecture (ISA) bus, an INFINIBANDinterconnect, a low-pin-count (LPC) bus, a memory bus, a Micro ChannelArchitecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, aPCI-Express (PCIe) bus, a serial advanced technology attachment (SATA)bus, a Video Electronics Standards Association local (VLB) bus, oranother suitable bus or a combination of two or more of these. Bus 512may include one or more buses 512, where appropriate. Although thisdisclosure describes and illustrates a particular bus, this disclosurecontemplates any suitable bus or interconnect.

Herein, a computer-readable non-transitory storage medium or media mayinclude one or more semiconductor-based or other integrated circuits(ICs) (such, as for example, field-programmable gate arrays (FPGAs) orapplication-specific ICs (ASICs)), hard disk drives (HDDs), hybrid harddrives (HHDs), optical discs, optical disc drives (ODDs),magneto-optical discs, magneto-optical drives, floppy diskettes, floppydisk drives (FDDs), magnetic tapes, solid-state drives (SSDs),RAM-drives, SECURE DIGITAL cards or drives, any other suitablecomputer-readable non-transitory storage media, or any suitablecombination of two or more of these, where appropriate. Acomputer-readable non-transitory storage medium may be volatile,non-volatile, or a combination of volatile and non-volatile, whereappropriate.

Herein, “or” is inclusive and not exclusive, unless expressly indicatedotherwise or indicated otherwise by context. Therefore, herein, “A or B”means “A, B, or both,” unless expressly indicated otherwise or indicatedotherwise by context. Moreover, “and” is both joint and several, unlessexpressly indicated otherwise or indicated otherwise by context.Therefore, herein, “A and B” means “A and B, jointly or severally,”unless expressly indicated otherwise or indicated otherwise by context.

The scope of this disclosure encompasses all changes, substitutions,variations, alterations, and modifications to the example embodimentsdescribed or illustrated herein that a person having ordinary skill inthe art would comprehend. The scope of this disclosure is not limited tothe example embodiments described or illustrated herein. Moreover,although this disclosure describes and illustrates respectiveembodiments herein as including particular components, elements,functions, operations, or steps, any of these embodiments may includeany combination or permutation of any of the components, elements,functions, operations, or steps described or illustrated anywhere hereinthat a person having ordinary skill in the art would comprehend.Furthermore, reference in the appended claims to an apparatus or systemor a component of an apparatus or system being adapted to, arranged to,capable of, configured to, enabled to, operable to, or operative toperform a particular function encompasses that apparatus, system,component, whether or not it or that particular function is activated,turned on, or unlocked, as long as that apparatus, system, or componentis so adapted, arranged, capable, configured, enabled, operable, oroperative.

What is claimed is:
 1. A method comprising: by a computing device, receiving a request for a route from a first geolocation to a second geolocation; by the computing device, calculating the route from the first geolocation to the second geolocation; by the computing device, identifying one or more logged paths of a user that coincide with at least a portion of the route; by the computing device, updating one or more navigation instructions for the route based on the identified logged paths of the user; and by the computing device, providing the updated navigation instructions.
 2. The method of claim 1, further comprising determining the logged paths based on location data of the user.
 3. The method of claim 2, further comprising polling a mobile computing device of the user to obtain the previous location data.
 4. The method of claim 2, wherein the location data comprises global positioning system (GPS), cellular triangulation, or wireless hotspot data received from a mobile computing device of the user.
 5. The method of claim 1, further comprising replacing navigation instructions corresponding to the portion of the route with instructions related to the identified logged paths.
 6. The method of claim 1, wherein a remainder of the route comprises turn-by-turn directions.
 7. The method of claim 1, wherein the logged paths comprise a geolocation associated with the user.
 8. The method of claim 7, further comprising accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, and each node corresponding to an object associated with a social network, wherein the geolocation associated with the user corresponds to a particular node of the social graph.
 9. The method of claim 8, wherein the particular node comprises a node associated with a check-in by the user.
 10. The method of claim 8, wherein the particular node comprises a node associated with information of the user.
 11. The method of claim 1, wherein identifying one or more logged paths is based at least in part on an identifier of the user.
 12. The method of claim 1, further comprising accessing a data store for the logged paths.
 13. The method of claim 1, further comprising identifying a highest ranked logged path based on a frequency that each of the logged paths is traveled by the user.
 14. The method of claim 1, wherein the receiving the request for the route comprises by the computing device, receiving the request from a route guidance application.
 15. One or more computer-readable non-transitory storage media embodying software that is operable when executed to: receive a request for a route from a first geolocation to a second geolocation; calculate the route from the first geolocation to the second geolocation; identify one or more logged paths of a user that coincide with at least a portion of the route; update one or more navigation instructions for the route based on the identified logged paths of the user; and provide the updated navigation instructions.
 16. The media of claim 15, wherein the software is further operable to determine the logged paths based on location data of the user.
 17. The media of claim 15, wherein the software is further operable to replace navigation instructions corresponding to the portion of the route with instructions of the identified logged paths.
 18. A system comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to: receive a request for a route from a first geolocation to a second geolocation; calculate the route from the first geolocation to the second geolocation; identify one or more logged paths of a user that coincide with at least a portion of the route; update one or more navigation instructions for the route based on the identified logged paths of the user; and provide the updated navigation instructions.
 19. The system of claim 18, wherein the instructions are further operable to determine the logged paths based on location data of the user.
 20. The system of claim 18, wherein the instructions are further operable to replace navigation instructions corresponding to the portion of the route with instructions of the identified logged paths. 